Paramodulation with Well-founded Orderings
نویسندگان
چکیده
منابع مشابه
Paramodulation with Well-founded Orderings
For many years, all existing completeness results for KnuthBendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By u...
متن کاملWell-founded Path Orderings for Operads
The definition herein of the Graph Path Ordering (GPO) on certain graph expressions is inspired by that of the Recursive Path Ordering (RPO), and enjoys all those properties that have made RPO popular, in particular, well-foundedness and monotonicity on variable-free terms. We are indeed interested in a generalization of algebraic expressions called operadic expressions, which are finite graphs...
متن کاملParamodulation with Non-Monotonic Orderings
All current completeness results for ordered paramodulation require the term ordering to be well-founded, monotonic and total(izable) on ground terms. Here we introduce a new proof technique where the only properties required for are well-foundedness and the subterm property1. The technique is a relatively simple and elegant application of some fundamental results on the termination and conflue...
متن کاملImplementation in Acl2 of Well-Founded Polynomial Orderings
This paper presents how the development of a polynomial ordering and the veri cation of its properties can be t in the framework of Acl2. The key result is the well-foundedness of a polynomial ordering, which is proved by a proper ordinal embedding. Normalized polynomials have been formalized to achieve this. The motivation for this work is to serve as a basis for proving the termination of cer...
متن کاملEfficient Approximation of Well-Founded Justification and Well-Founded Domination
Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded justification (WFJ), due to computational cost. However, we demonstrate that this can hinder propagation of many relevant conditions such as reachability. In order to perform WFJ with low computational cost, we devise a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2008
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exn073